A Comparison of Various Meshless Schemes Within a Unified Algorithm

نویسندگان

  • Aaron Katz
  • Antony Jameson
چکیده

An algorithm for use with several meshless schemes is presented based on a local extremum diminishing property. The scheme is applied to the Euler equations in two dimensions. The algorithm is suitable for use with many meshless schemes, three of which are detailed here. First, a method based on Taylor series expansion and least squares is highlighted. Next, a similar least squares method is used, but using polynomial basis functions with fixed Gaussian weighting. A third method makes use of the Hardy multiquadric radial basis functions on a local cloud of points. Results indicate that all three methods perform essentially equally well for flows without shocks. For flows with shocks, the least squares methods perform significantly better than the radial basis method, which displays discrepancies in shock location and magnitude. All methods are compared to an established finite volume method for validation purposes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An EM Algorithm for Estimating the Parameters of the Generalized Exponential Distribution under Unified Hybrid Censored Data

The unified hybrid censoring is a mixture of generalized Type-I and Type-II hybrid censoring schemes. This article presents the statistical inferences on Generalized Exponential Distribution parameters when the data are obtained from the unified hybrid censoring scheme. It is observed that the maximum likelihood estimators can not be derived in closed form. The EM algorithm for computing the ma...

متن کامل

Optimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...

متن کامل

Implicit RBF Meshless Method for the Solution of Two-dimensional Variable Order Fractional Cable Equation

In the present work, the numerical solution of two-dimensional variable-order fractional cable (VOFC) equation using meshless collocation methods with thin plate spline radial basis functions is considered. In the proposed methods, we first use two schemes of order O(τ2) for the time derivatives and then meshless approach is applied to the space component. Numerical results obtained ...

متن کامل

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)

Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009